Method for representing data from non-relational, non-object-oriented datastores as queryable datastore persistent objects

ABSTRACT

A method, apparatus, and article of manufacture for representing data from non-object-oriented external datastores as queryable datastore persistent objects. A computerized system in accordance with the principles of the present invention includes a “bridge” for locating a logical unit of data in a non-object-oriented datastore, for retrieving the data from the datastore, and for mapping the data retrieved from the datastore into a datastore persistent object so that the data is encapsulated within the datastore persistent object.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of and commonly-assigned patent application Ser. No. 08/736,759, entitled “METHOD FOR REPRESENTING DATA FROM NON-RELATIONAL, NON-OBJECT-ORIENTED DATASTORES AS QUERYABLE DATASTORE PERSISTENT OBJECTS,” filed on Oct. 25, 1996, by Kenneth R. Blackman and Jack L. Howe III, now U.S. Pat. No. 5,794,247; which application is incorporated by reference herein.

This application is related to the following and commonly-assigned patent applications:

Application Ser. No. 08/736,762 entitled “A FRAMEWORK FOR OBJECT-ORIENTED ACCESS TO NON-OBJECT-ORIENTED DATASTORES,” filed on same date herewith, by Kenneth R. Blackman and Jack L. Howe III, U.S. Pat. No. 5,799,313;

Application Ser. No. 08/736,763, entitled “A METHOD FOR REPRESENTING NON-OBJECT-ORIENTED DATASTORES USING A COLLECTION OF COLLECTIONS DATA MODEL,” filed on same date herewith, by Kenneth R. Blackman and Jack L. Howe III, U.S. Pat. No. 5,794,248;

Application Ser. No. 08/738,294, entitled “A METHOD FOR THE INCREMENTAL PRESENTATION OF NON-OBJECT-ORIENTED DATASTORES USING AN OBJECT-ORIENTED QUERYABLE DATASTORE COLLECTION,” filed on same date herewith, by Kenneth R. Blackman and Jack L. Howe III, U.S. Pat. No. 5,781,907;

Application Ser. No. 08/738,104, entitled “A QUERY SYNTAX FOR ACCESSING NON-RELATIONAL, NON-OBJECT-ORIENTED DATASTORES,” filed on same date herewith, by Kenneth R. Blackman and Jack L. Howe III, U.S. Pat. No. 5,778,379;

Application Ser. No. 08/738,082, entitled “A QUERY PARSER FOR ACCESSING NON-RELATIONAL, NON-OBJECT-ORIENTED DATASTORES,” filed on same date herewith, by Kenneth R. Blackman and Jack L. Howe III, U.S. Pat. No. 5,788,358;

Application Ser. No. 08/736,330, entitled “A METHOD FOR USING A DATASTORE CURSOR FOR THE INCREMENTAL PRESENTATION OF QUERY RESULTS WHEN TRAVERSING IMPLIED COLLECTIONS IN NON-OBJECT-ORIENTED DATASTORES,” filed on same date herewith, by Kenneth R. Blackman and Jack L. Howe III, U.S. Pat. No. 5,787,436;

Application Ser. No. 08/736,764, entitled “A METHOD FOR ENCAPSULATING DATA FROM NON-OBJECT-ORIENTED DATASTORES AS DATASTORE PERSISTENT OBJECTS,” filed on same date herewith, by Kenneth R. Blackman and Jack L. Howe III, U.S. Pat. No. 5,765,161;

Application Ser. No. 08/738,103, entitled “A METHOD FOR USING QUERYABLE PERSISTENT IDENTIFIERS TO LOCATE DATA FOR DATASTORE PERSISTENT OBJECTS IN NON-OBJECT-ORIENTED DATASTORES,” filed on same date herewith, by Kenneth R. Blackman and Jack L. Howe III, U.S. Pat. No. 5,765,163;

Application Ser. No. 08/736,983, entitled “A METHOD FOR INTERFACING QUERYABLE DATASTORE PERSISTENT OBJECTS TO NON-RELATIONAL, NON-OBJECT-ORIENTED DATASTORES,” filed on same date herewith, by Kenneth R. Blackman and Jack L. Howe III, U.S. Pat. No. 5,761,671;

Application Ser. No. 08/736,952, entitled “A METHOD FOR MANAGING QUERYABLE DATASTORE PERSISTENT OBJECTS AND QUERYABLE DATASTORE COLLECTIONS IN AN OBJECT-ORIENTED ENVIRONMENT,” filed on same date herewith, by Kenneth R. Blackman and Jack L. Howe III, U.S. Pat. No. 5,765,162;

Application Ser. No. 08/736,765, entitled “A METHOD FOR CATALOGING DATASTORE CHARACTERISTICS AND DEFINING AND GENERATING DATASTORE PERSISTENT OBJECTS,” filed on same date herewith, by Kenneth R. Blackman and Jack L. Howe III, U.S. Pat. No. 5,737,597;

Application Ser. No. 08/736,922, entitled “A METHOD FOR CAPTURING AND CATALOGING DATASTORE CHARACTERISTICS TO DEFINE DATASTORE PERSISTENT OBJECTS,” filed on same date herewith, by Kenneth R. Blackman and Jack L. Howe III, U.S. Pat. No. 5,809,508;

Application Ser. No. 08/738,102, entitled “A METHOD FOR CAPTURING AND CATALOGING SPECIFICATIONS FOR DATASTORE PERSISTENT CLASSES,” filed on same date herewith, by Kenneth R. Blackman and Jack L. Howe III, U.S. Pat. No. 5,737,598;

Application Ser. No. 08/738,761, entitled “A METHOD FOR CAPTURING AND CATALOGING PROGRAM CHARACTERISTICS FOR THE USAGE OF DATASTORE PERSISTENT CLASSES,” filed on same date herewith, by Kenneth R. Blackman and Jack L. Howe III, U.S. Pat. No. 5,764,979; and

Application Ser. No. 08/738,105, entitled “A METHOD FOR USING A NON-OBJECT-ORIENTED DATASTORE AS A GENERIC PERSISTENT DATASTORE FOR PERSISTENT OBJECTS,” filed on same date herewith, by Kenneth R. Blackman and Jack L. Howe III, U.S. Pat. No. 5,809,509;

all of which applications are incorporated by reference herein.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates generally to computerized methods for accessing datastores, and in particular, to a computerized object-oriented method for accessing non-object-oriented datastores.

2. Description of Related Art

It is well known in the art to use database management systems, such as IBM's IMS™ (Information Management System) database management system, to manage computerized datastores. Indeed, IMS™ has been used for decades and remains in use today. Currently, there is a need to access such “legacy” datastores using application programs developed by object-oriented programming systems (OOPS). However, there are few tools available to assist OOPS programmers.

One method for allowing object-oriented application programs to access data in an IMS™ datastore is through transaction wrappering, implemented in such products such as IBM's VisualAge™ IMS Connection product. Transaction wrappering creates a class having methods that retrieve data from the IMS™ datastore, create an object embodying the retrieved data, and manipulate the object in an object-oriented application program. The problem with this approach is that each object-oriented application requires substantial additional coding, both object-oriented and non-object-oriented, before it is able to access the data in the IMS™ datastore.

Another approach to accessing data in a non-relational, non-object-oriented datastore is to translate the non-relational datastore to a relational datastore, and use existing object-oriented programming techniques developed for relational datastores to access the data therein. The problem with this approach is that non-relational data, such as the hierarchical data found in an IMS™ datastore, does not map well to a relational datastore.

Thus, there is a need in the art for improved techniques for bridging between non-object-oriented datastores and object-oriented application programs.

SUMMARY OF THE INVENTION

To overcome the limitations in the prior art described above, and to overcome other limitations that will become apparent upon reading and understanding the present specification, the present invention discloses a method, apparatus, and article of manufacture for representing data from non-object-oriented external datastores as queryable datastore persistent objects. A computerized system in accordance with the principles of the present invention includes a “bridge” for locating a logical unit of data in a non-object-oriented datastore, for retrieving the data from the datastore, and for mapping the data retrieved from the datastore into a datastore persistent object so that the data is encapsulated within the datastore persistent object.

Various advantages and features of novelty which characterize the invention are pointed out with particularity in the claims annexed hereto and form a part hereof. However, for a better understanding of the invention, its advantages, and the objects obtained by its use, reference should be made to the drawings which form a further part hereof, and to accompanying descriptive matter, in which there is illustrated and described specific examples of an apparatus in accordance with the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

Referring now to the drawings in which like reference numbers represent corresponding parts throughout:

FIG. 1 is a block diagram illustrating an exemplary hardware environment used to implement the preferred embodiment of the invention;

FIG. 2 is a block diagram illustrating the collection of collections data model used in the present invention;

FIG. 3 is a block diagram illustrating an exemplary datastore collection of the bridge according to the present invention;

FIG. 4 is a block diagram illustrating the operation of the bridge according to the present invention;

FIG. 5 is a block diagram illustrating the structure and relationship between a datastore persistent object and its persistent identifier (PID) according to the present invention; and

FIG. 6 is a block diagram illustrating the operation of the instance manager according to the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

In the following description of the preferred embodiment, reference is made to the accompanying drawings which form a part hereof, and in which is shown by way of illustration a specific embodiment in which the invention may be practiced. It is to be understood that other embodiments may be utilized and structural changes may be made without departing from the scope of the present invention.

Overview

The present invention represents data from non-object-oriented external datastores as queryable datastore persistent objects. A computerized system in accordance with the principles of the present invention includes a “bridge” for locating a logical unit of data in a non-object-oriented datastore, for retrieving the data from the datastore, and for mapping the data retrieved from the datastore into a datastore persistent object so that the data is encapsulated within the datastore persistent object.

Hardware Environment

FIG. 1 is a block diagram illustrating an exemplary hardware environment used to implement the preferred embodiment of the invention. A workstation or terminal 100 communicates with a server computer 102. Both the workstation 100 and the server computer 102 are typically comprised of one or more processors, random access memory (RAM), read-only memory (ROM), and other components such data storage devices and data communications devices.

The workstation 100 executes one or more computer programs 104 operating under the control of an operating system 106, such as the MVS™, VM™, AIX™, OS/2™, Windows™, Macintosh™, AS/400™, or UNIX™ operating systems. These computer programs 104 transmit commands to the server computer 102 for performing various functions and receive data from the server computer 102 in response to the commands.

The server computer 102 also operates under the control of an operating system 108, such as the MVS™, VM™, AIX™, OS/2™, Windows™, Macintosh™, AS/400™, or UNIX™ operating systems. The server computer 102 executes one or more computer programs 110 and 112 under the control of the operating system 108. These computer programs 110 and 112 receive commands from the workstation 100 for performing various functions and transmit data to the workstations 100 in response to the commands.

The server computer 102 manages one or more external databases or datastores 114 stored on one or more data storage devices 116 (such as a fixed or hard disk drive, a floppy disk drive, a CD-ROM drive, a tape drive, or other device). In the preferred embodiment, the external datastore 114 comprises an IMS™ datastore managed by an IMS™ database management system (DBMS) product offered by IBM Corporation. Those skilled in the art will recognize, however, that the present invention may be applied to any datastore and associated database management system.

The present invention is generally implemented using five major components executed by the workstation 100 and the server computer 102, i.e., object-oriented application program 104, workstation operating system 106, server operating system 108, bridge 110, and datastore manager (DSM) 112, wherein each of these components comprise one or more computer programs. The object-oriented application program 104 performs application functions; the workstation operating system 106 controls the operation of the workstation 100; the server operating system 108 controls the operation of the server computer 102; the bridge 110 materializes data retrieved from the external database 114 as objects; and the datastore manager 112 controls access to the external database 114.

Generally, these computer programs 104-112 are all tangibly embodied in or retrievable from a computer-readable medium, e.g., a data storage device or a data communications device. Moreover, the computer programs are all comprised of instructions which, when read and executed by the workstation 100 and/or server computer 102, causes the workstation 100 and/or server computer 102 to perform the steps necessary to implement and/or use the present invention.

Those skilled in the art will recognize that any combination of the above components, or any number of different components, including computer programs, peripherals, and other devices, may be used to implement the present invention, so long as similar functions are performed thereby.

Datastore Model

FIG. 2 is a block diagram illustrating the collection of collections data model used in the present invention. Data retrieved from the non-object-oriented external datastore 114 is modeled as a “collection of object collections” in the bridge 110. Where the external data has a simple structure, each record is encapsulated as an object, which becomes a member of an object collection. Where the records are hierarchical in structure, that hierarchical structure is modeled by creating object collections and then hierarchically connecting the related object collections. Other complex logical records can be modeled as a hierarchy of object collections. A single collection of collections is materialized for each datastore, e.g., the object model of two flat files is a model having two collections of collections.

Block 200 represents the logical hierarchical structure of the data as stored in the external datastore 114, and block 202 represents the logical “collection of object collections” structure created from the data retrieved from the external datastore 114. The bridge 110 translates the data between the differing formats and structures in blocks 200 and 202.

In the logical hierarchical structure of block 200, parent record A (204) has children records B (206) and C (208), and child record C (208) is also a parent of children records D (210) and E (212). There may also be multiple instances of parent record A (214 and 216).

Similarly, in the logical “collection of object collections” structure of block 202, parent object A (218) has children objects B (220) and C (222), and child object C (222) is also a parent of children objects D (224) and E (226). Further, there are multiple instances of parent object A (228 and 230). Each of these objects is a datastore persistent object (DPO) that encapsulates a logical unit of data, i.e., record, retrieved from the non-object-oriented datastore, and includes member functions for manipulating the encapsulated data. Thus, the difference between blocks 200 and 202 is that each record A, B, or C in block 200 is represented by a DPO in block 202, and the hierarchy in block 200 is represented by the collections of object collections in block 202.

Datastore Collection

The bridge 110 manages “datastore collections”, which are the foundation of the “collections of object collections” data model. The members of the datastore collection are the DPOs. The datastore collection also includes a query evaluator having a query syntax and a query parser, a queryable datastore cursor, and an associated result collection with a cursor. For complex queries, queries may be sub-divided. Results for the queries are presented in user-specifiable increments, which permits the delivery of large result collections while controlling use of memory.

FIG. 3 is a block diagram illustrating an exemplary datastore collection 300 of the bridge 110 according to the present invention. The datastore collection 300 includes a query evaluator 302 for receiving a query from the application program 104, wherein the query evaluator 302 comprises a query syntax and a query parser. The query evaluator 302 parses the query request in accordance with the query syntax and stores the parsed request in a parse table in a query object 304. A datastore cursor 306 retrieves the parsed query from the query object 304 and provides the parsed query to an instance manager 308, which coordinates requests from the application program 104 with the datastore collection 300 and the external datastore 114. The instance manager 308 uses a schema mapper 310 to interface with the datastore manager 112. The datastore manager 112 retrieves data from the external datastore 114 on the external storage device 116 and returns the requested data to the schema mapper 310. The schema mapper 310 translates common elements between the requested data retrieved from the external datastore 114 and a DPO 312, which results in the requested data being encapsulated in the DPO 312. The schema mapper 310 returns the DPO 312 through the instance manager 308 to the datastore cursor 306 which stores the DPO 312 in the result collection 314. Generally, the result collection 314 comprises one or more DPOs 316, 318, and 320.

The datastore cursor 306 populates the result collection 314 so that the application program 104 can incrementally access the query result. Because the number of data items or records requested by the query may be large, the datastore cursor 306 only populates the result collection 314 with a specified number of DPOs 316, 318, and 320 that correspond to the query request. A pointer to the current DPOs 316, 318, or 320 is maintained by the cursor 322, and the size of the result collection 314 is determined by a size variable 324.

If the application program 104 needs to access more data items or records that satisfy the query, the datastore cursor 306 deletes one or more of the DPOs 316, 318, and 320 from the result collection 314 and requests the instance manager 308, through the schema mapper 310, to retrieve additional DPOs 312, up to the number indicated in the size variable 324, into the result collection 314.

In addition to populating a DPO 312 with data from the external datastore 114, the schema mapper 310 updates the external datastore 114 with changed data from the DPO 312. The schema mapper 310 may add data to the external datastore 114 when a new DPO 312 is created, and the schema mapper 310 may delete corresponding data from the external datastore 114 when a existing DPO 312 is deleted.

The schema mapper 310 translates queries to specific instructions for the datastore manager 112. Generally, these instructions comprise: SELECT, UPDATE, INSERT and DELETE, wherein the SELECT instruction retrieves data from the external datastore 114 via the datastore manager 112 for a DPO 312; the UPDATE instruction, following a SELECT, saves changed data from the DPO 312 into the external datastore 114 via the datastore manager 112; the INSERT instruction saves new data from the DPO 312 into the external datastore 114 via the datastore manager 112; and the DELETE instruction deletes the DPO 312 and its corresponding data from the external datastore 114 via the datastore manager 112.

Datastore Persistent Objects (DPOs)

The members, or elements, of the datastore collection 300 are queryable DPOs 316, 318, and 320 that encapsulate external data, i.e., records retrieved from the external datastore 114, with associated methods to move data with data type integrity between the DPOs 316, 318, and 320, and the records of the external datastore 114. Thus, a DPO 316, 318, and 320 makes non-object-oriented data accessible as “base class objects” that may be used or wrappered by other classes in an object-oriented programming system. Further, the data being encapsulated by the DPOs 316, 318, and 320 may or may not be concurrently shared or updated between object-oriented and non-object-oriented applications, depending on the characteristics of the underlying datastore 114.

The bridge 110 thus comprises a queryable persistence implementation that can be used to access data in non-object-oriented datastores 114. The bridge 110 provides a datastore persistent object class to wrapper data retrieved from the external datastore 114, a queryable persistent identifier (PID) used to specify information used to locate the data in the external datastore 114 needed to populate the particular DPO 312, and a schema mapper class used to obtain the required data from the external datastore 114 and translate or transfer it into the format of the particular DPO 312.

FIG. 4 is a block diagram illustrating the operation of the bridge 110 according to the present invention. The application program 104 passes a query request to the datastore collection 300. The datastore collection 300 evaluates the query and passes control to the datastore cursor 306 for processing. The datastore cursor 306 creates a DPO 312 and its associated PID 400. The PID 400 is used to specify the query information needed to locate the data in the external datastore 114.

The DPO 312 and PID 400 are passed to the instance manager 308 who requests that the schema mapper 310 retrieve the data via the datastore manager 112 for storing into the DPO 312. The schema mapper 310 looks at the DPO 312 accompanying PID 400 which has information from the query object 304 for locating data. The schema mapper 310 provides the input/output commands to the datastore manager 112 using information from a subschema mapper 402 and program specification block (PSB) 404. The schema mapper 310 receives the located logical unit of data from the datastore manager 112 and maps the located data into the DPO 312, thereby “wrappering” the logical unit of data. Upon completion of the operation, the DPO 312 then encapsulates the data retrieved by the schema mapper 310.

Persistent Identifier (PID)

FIG. 5 is a block diagram illustrating the structure and relationship between a DPO 312 and its PID 400 according to the present invention, wherein the PID 400 has fields for storing the datastore type 500, locator 502, search indicator 504, key 506, and locator validity 508, and the DPO 312 has a memory status 510 and a persistence status 512.

The datastore type field 500 indicates the datastore type, e.g., IMS™, VSAM™, etc. The locator field 502 stores the relevant query information from the query object 304. The search indicator field 504 indicates the method of retrieving additional DPOs, i.e., a FIRST, NEXT, or KEY retrieval, wherein a FIRST or NEXT retrieves additional datastore persistent objects through the locator field 502 and a KEY indicates that a single instance will be retrieved through the key field 506. The key field 506 stores the key to be used to locate data. The locator validity field 508 indicates whether the locator field 502 and key field 506 have been validated by the datastore manager 112.

The memory status 510 is either active, indicating that data from the external datastore 114 has been materialized in the DPO 312, or passive, indicating that the DPO 312 contains no such data. The persistence status 512 is a relative comparison of the data contained in the DPO 312 and the external datastore 114, indicating whether the data has been changed or not within the DPO 312.

Instance Manager

FIG. 6 is a block diagram illustrating the operation of the instance manager 308 according to the present invention.

In the run-time environment, the datastore collections 300 and DPOs 316, 318, and 320 are managed (e.g., created, tracked, materialized, destroyed, and garbage collected) by the instance manager 308. The instance manager 308 also participates in the unit-of-work between the application program 104 being served and the external datastore 114.

Although the interface to the application program 104 remains constant, the level of service provided by the instance manager 308 will vary according to the characteristics of the external datastore 114. The instance manager 308 will exploit the capabilities of the external datastore 114 and the datastore manager 112 wherever possible, e.g., with regard to query functions, concurrency, security, etc.

The instance manager 308 uses service classes to isolate some of its functions, system services object (SSO) 600, interface object services (IOS) 602, and subschema mapper 402. The SSO 600 serves as a “factory” for creating DPO 312 and datastore collections 300 requested by query objects 304. The SSO 600 further serves as a transaction manager for the unit-of-work.

The SSO 600 receives a unit-of-work request from the application program 104. The SSO 600 creates a subschema mapper 402 and opens a PSB 404 for the unit-of-work request. The SSO 600 interfaces to the datastore manager 112 through the IOS 602. The IOS 602 opens and closes the connection to the datastore manager 112.

Using the schema mapper 310, the instance manager 308 populates the datastore collection 300 with DPOs 316, 318, and 320 that encapsulate data retrieved from the external datastore 114 via the datastore manager 112. The schema mapper 310 updates the external datastore 114 with changed data from the DPOs 316, 318, and 320, and adds or deletes the associated elements from the external datastore 114 when the DPOs 316, 318, and 320 are added or deleted.

The SSO 600 propagates a request to complete a unit-of-work to the instance manager 308, the datastore collection 300, the schema mapper 310, and the DPOs 316, 318, and 320, so as to coordinate the requests with the datastore manager 112 to maintain the integrity of the external datastore 114. Upon completion of the unit-of-work, the instance manager 308 deletes the DPOs 316, 318 and 320, the datastore collection 300, and schema mapper 310, from the memory of the server computer 102.

Conclusion

This concludes the description of the preferred embodiment of the invention. The following paragraphs describe some alternative methods of accomplishing the same objects.

In alternative embodiments of the present invention, other types and configurations of computers could be used. For example, the invention need not be restricted to client-server configurations. In addition, mainframes, minicomputers, or personal computers, could be used with the present invention.

In alternative embodiments of the present invention, other types and configurations of computer programs could be used. For example, the invention need not be restricted to client-server configurations.

In alternative embodiments of the present invention, other database management systems could be used. For example, the invention need not be restricted to IMS™ database management systems. In addition, the present invention could be used to model other types of information.

In summary, a method, apparatus and article of manufacture for representing data from non-object-oriented external datastores as queryable datastore persistent objects has been described. A computerized system in accordance with the principles of the present invention includes a “bridge” for locating a logical unit of data in a non-object-oriented datastore, for retrieving the data from the datastore, and for mapping the data retrieved from the datastore into a datastore persistent object so that the data is encapsulated within the datastore persistent object.

The foregoing description of the preferred embodiment of the invention has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. It is intended that the scope of the invention be limited not by this detailed description, but rather by the claims appended hereto. 

What is claimed is:
 1. A computerized method of data retrieval, comprising the steps of: creating a data structure in a memory of a computer for use by a computer program executed by the computer, wherein the data structure comprises one or more queryable objects; encapsulating data retrieved from a non-relational, non-object-oriented datastore in the objects, wherein each of the objects includes one or more associated methods to move data between the objects and the datastore.
 2. The method of claim 1 above, wherein the objects are datastore persistent objects.
 3. The method of claim 1 above, wherein the objects comprise base class objects that are used by other classes in an object-oriented programming system.
 4. The method of claim 1 above, wherein the objects comprise base class objects that are wrappered by other classes in an object-oriented programming system.
 5. The method of claim 1 above, wherein the data encapsulated by the objects is concurrently shared between object-oriented and non-object-oriented application programs.
 6. The method of claim 1 above, wherein the data is concurrently shared through the non-relational, non-object-oriented datastore.
 7. The method of claim 1 above, wherein the data encapsulated by the objects is concurrently updated between object-oriented and non-object-oriented computer programs.
 8. The method of claim 1 above, wherein the data is concurrently updated through the non-relational, non-object-oriented datastore.
 9. The method of claim 1 above, wherein each object has an associated identifier that is used to specify information used to locate the data in the non-relational, non-object-oriented datastore.
 10. The method of claim 9 above, wherein each identifier is comprised of one or more fields selected from the group comprising a datastore type, locator, search indicator, key, and locator validity.
 11. The method of claim 10 above, wherein the datastore type indicates the non-relational, non-object-oriented datastore's type.
 12. The method of claim 10 above, wherein the locator stores the relevant query information.
 13. The method of claim 10 above, wherein the search indicator indicates a method for retrieving additional data from the non-relational, non-object-oriented datastore.
 14. The method of claim 13 above, wherein the search indicator indicates that additional objects are retrieved through the locator.
 15. The method of claim 13 above, wherein the search indicator indicates that additional objects are retrieved through the key.
 16. The method of claim 13 above, wherein the key stores a value used to locate the data.
 17. The method of claim 10 above, wherein the locator validity indicates whether the locator and key have been validated by the non-relational, non-object-oriented datastore.
 18. The method of claim 1 above, wherein each object further includes one or more fields selected from a group comprising a memory status and persistence status.
 19. The method of claim 18 above, wherein an active memory status indicates that data from the non-relational, non-object-oriented datastore has been materialized in the object.
 20. The method of claim 18 above, wherein a passive memory status indicates that the object contains no data.
 21. The method of claim 18 above, wherein the persistence status is a relative comparison of the data contained in the object and the non-relational, non-object-oriented datastore.
 22. A data structure stored in a memory for use by a computer program executed by a computer, the data structure comprising one or more queryable objects that encapsulate data retrieved from a non-relational, non-object-oriented datastore, and each of the objects including one or more associated methods to move data between the objects and the datastore.
 23. The data structure of claim 22 above, wherein the objects are datastore persistent objects.
 24. The data structure of claim 22 above, wherein the objects comprise base class objects that are used by other classes in an object-oriented programming system.
 25. The data structure of claim 22 above, wherein the objects comprise base class objects that are wrappered by other classes in an object-oriented programming system.
 26. The data structure of claim 22 above, wherein the data encapsulated by the objects is concurrently shared between object-oriented and non-object-oriented application programs.
 27. The data structure of claim 22 above, wherein the data is concurrently shared through the non-relational, non-object-oriented datastore.
 28. The data structure of claim 22 above, wherein the data encapsulated by the objects is concurrently updated between object-oriented and non-object-oriented computer programs.
 29. The data structure of claim 22 above, wherein the data is concurrently updated through the non-relational, non-object-oriented datastore.
 30. The data structure of claim 22 above, wherein each object has an associated identifier that is used to specify information used to locate the data in the non-relational, non-object-oriented datastore.
 31. The data structure of claim 30 above, wherein each identifier is comprised of one or more fields selected from the group comprising a datastore type, locator, search indicator, key, and locator validity.
 32. The data structure of claim 31 above, wherein the datastore type indicates the non-relational, non-object-oriented datastore's type.
 33. The data structure of claim 31 above, wherein the locator stores the relevant query information.
 34. The data structure of claim 31 above, wherein the search indicator indicates a method for retrieving additional data from the non-relational, non-object-oriented datastore.
 35. The data structure of claim 34 above, wherein the search indicator indicates that additional objects are retrieved through the locator.
 36. The data structure of claim 34 above, wherein the search indicator indicates that additional objects are retrieved through the key.
 37. The data structure of claim 34 above, wherein the key stores a value used to locate the data.
 38. The data structure of claim 31 above, wherein the locator validity indicates whether the locator and key have been validated by the non-relational, non-object-oriented datastore.
 39. The data structure of claim 22 above, wherein each object further includes one or more fields selected from a group comprising a memory status and persistence status.
 40. The data structure of claim 39 above, wherein an active memory status indicates that data from the non-relational, non-object-oriented datastore has been materialized in the object.
 41. The data structure of claim 39 above, wherein a passive memory status indicates that the object contains no data.
 42. The data structure of claim 39 above, wherein the persistence status is a relative comparison of the data contained in the object and the non-relational, non-object-oriented datastore.
 43. A computerized data retrieval apparatus, comprising: a computer having a memory; and a data structure stored in the memory for use by a computer program executed by the computer, wherein the data structure comprises one or more queryable objects that encapsulate data retrieved from a non-relational, non-object-oriented datastore, and each of the objects includes one or more associated methods to move data between the objects and the datastore.
 44. The apparatus of claim 43 above, wherein the objects are datastore persistent objects.
 45. The apparatus of claim 43 above, wherein the objects comprise base class objects that are used by other classes in an object-oriented programming system.
 46. The apparatus of claim 43 above, wherein the objects comprise base class objects that are wrappered by other classes in an object-oriented programming system.
 47. The apparatus of claim 43 above, wherein the data encapsulated by the objects is concurrently shared between object-oriented and non-object-oriented application programs.
 48. The apparatus of claim 43 above, wherein the data is concurrently shared through the non-relational, non-object-oriented datastore.
 49. The apparatus of claim 43 above, wherein the data encapsulated by the objects is concurrently updated between object-oriented and non-object-oriented computer programs.
 50. The apparatus of claim 43 above, wherein the data is concurrently updated through the non-relational, non-object-oriented datastore.
 51. The apparatus of claim 43 above, wherein each object has an associated identifier that is used to specify information used to locate the data in the non-relational, non-object-oriented datastore.
 52. The apparatus of claim 51 above, wherein each identifier is comprised of one or more fields selected from the group comprising a datastore type, locator, search indicator, key, and locator validity.
 53. The apparatus of claim 52 above, wherein the datastore type indicates the non-relational, non-object-oriented datastore's type.
 54. The apparatus of claim 52 above, wherein the locator stores the relevant query information.
 55. The apparatus of claim 52 above, wherein the search indicator indicates a apparatus for retrieving additional data from the non-relational, non-object-oriented datastore.
 56. The apparatus of claim 55 above, wherein the search indicator indicates that additional objects are retrieved through the locator.
 57. The apparatus of claim 55 above, wherein the search indicator indicates that additional objects are retrieved through the key.
 58. The apparatus of claim 55 above, wherein the key stores a value used to locate the data.
 59. The apparatus of claim 52 above, wherein the locator validity indicates whether the locator and key have been validated by the non-relational, non-object-oriented datastore.
 60. The apparatus of claim 43 above, wherein each object further includes one or more fields selected from a group comprising a memory status and persistence status.
 61. The apparatus of claim 60 above, wherein an active memory status indicates that data from the non-relational, non-object-oriented datastore has been materialized in the object.
 62. The apparatus of claim 60 above, wherein a passive memory status indicates that the object contains no data.
 63. The apparatus of claim 60 above, wherein the persistence status is a relative comparison of the data contained in the object and the non-relational, non-object-oriented datastore.
 64. A program storage medium readable by a computer having a memory, the medium tangibly embodying one or more instructions executable by the computer to perform method steps for retrieving data from a non-relational, non-object-oriented datastore, the method comprising the steps of: creating a data structure in the memory of the computer for use by a computer program executed by the computer, wherein the data structure comprises one or more queryable objects; and encapsulating data retrieved from a non-relational, non-object-oriented datastore in the objects, wherein each of the objects includes one or more associated methods to move data between the objects and the datastore.
 65. The program storage medium of claim 64 above, wherein the objects are datastore persistent objects.
 66. The program storage medium of claim 64 above, wherein the objects comprise base class objects that are used by other classes in an object-oriented programming system.
 67. The program storage medium of claim 64 above, wherein the objects comprise base class objects that are wrappered by other classes in an object-oriented programming system.
 68. The program storage medium of claim 64 above, wherein the data encapsulated by the objects is concurrently shared between object-oriented and non-object-oriented application programs.
 69. The program storage medium of claim 64 above, wherein the data is concurrently shared through the non-relational, non-object-oriented datastore.
 70. The program storage medium of claim 64 above, wherein the data encapsulated by the objects is concurrently updated between object-oriented and non-object-oriented computer programs.
 71. The program storage medium of claim 64 above, wherein the data is concurrently updated through the non-relational, non-object-oriented datastore.
 72. The program storage medium of claim 64 above, wherein each object has an associated identifier that is used to specify information used to locate the data in the non-relational, non-object-oriented datastore.
 73. The program storage medium of claim 72 above, wherein each identifier is comprised of one or more fields selected from the group comprising a datastore type, locator, search indicator, key, and locator validity.
 74. The program storage medium of claim 73 above, wherein the datastore type indicates the non-relational, non-object-oriented datastore's type.
 75. The program storage medium of claim 73 above, wherein the locator stores the relevant query information.
 76. The program storage medium of claim 73 above, wherein the search indicator indicates a program storage medium for retrieving additional data from the non-relational, non-object-oriented datastore.
 77. The program storage medium of claim 76 above, wherein the search indicator indicates that additional objects are retrieved through the locator.
 78. The program storage medium of claim 76 above, wherein the search indicator indicates that additional objects are retrieved through the key.
 79. The program storage medium of claim 76 above, wherein the key stores a value used to locate the data.
 80. The program storage medium of claim 73 above, wherein the locator validity indicates whether the locator and key have been validated by the non-relational, non-object-oriented datastore.
 81. The program storage medium of claim 64 above, wherein each object further includes one or more fields selected from a group comprising a memory status and persistence status.
 82. The program storage medium of claim 81 above, wherein an active memory status indicates that data from the non-relational, non-object-oriented datastore has been materialized in the object.
 83. The program storage medium of claim 81 above, wherein a passive memory status indicates that the object contains no data.
 84. The program storage medium of claim 81 above, wherein the persistence status is a relative comparison of the data contained in the object and the non-relational, non-object-oriented datastore. 